package com.dataStructures.recursion;

public class RecursionTest {
	public static void main(String[] args) {
		test(4);
		System.out.println(factorial(4));
	}

	private static void test(int n) {
		if (n > 2) {
			test(n - 1);
		}
		System.out.println(n);
	}

	/**
	 * 阶乘问题
	 */
	public static int factorial(int n) {
		if (n == 1) {
			return 1;
		}
		return factorial(n - 1) * n;
	}
}
